#!/usr/bin/python
def is_prime(n):
	for i in xrange(2, int(n**0.5) + 1):
		if n % i == 0:
			return False
	return True

number = 600851475143
for i in xrange(2,int(number**0.5)+2):
	if number % i == 0:
		if is_prime(i):
			print i
